The axiom of determinacy and the Wadge hierarchy
نویسندگان
چکیده
s for tutorials Alessandro Andretta, The axiom of determinacy and the Wadge hierarchy page 3 Martin Goldstern Real forcing page 3 Jouko Väänänen Set theory and model-theoretic logics page 4
منابع مشابه
Borel-amenable reducibilities for sets of reals
We show that if F is any “well-behaved” subset of the Borel functions and we assume the Axiom of Determinacy then the hierarchy of degrees on P(ωω) induced by F turns out to look like the Wadge hierarchy (which is the special case where F is the set of continuous functions).
متن کاملOperations on a Wadge-Type Hierarchy of Ordinal-Valued Functions
In this thesis we investigate – under the assumption of the Axiom of Determinacy (AD) – the structure of the hierarchy of regular norms, a Wadge-type hierarchy of ordinal-valued functions that originally arose from Moschovakis’s proof of the First Periodicity Theorem in descriptive set theory. We introduce the notion of a very strong better quasi-order that will provide a framework to treat the...
متن کاملThe Limits of Determinacy in Second Order Arithmetic: Consistency and Complexity Strength
We prove that determinacy for all Boolean combinations of Fσδ (Π 0 3) sets implies the consistency of second-order arithmetic and more. Indeed, it is equivalent to the statement saying that for every set X and every number n, there exists a β-model of Πn-comprehension containing X. We prove this result by providing a careful level-by-level analysis of determinacy at the finite level of the diff...
متن کاملAd and the Very Fine Structure of L(r)
We announce results concerning the detailed analysis of L(R) a considerable distance along its constructibility hierarchy, assuming the axiom of determinacy. Our main focus here is on the projective hierarchy, and specifically the sizes and properties of the projective ordinals. In particular, assuming determinacy, we calculate the values of the projective ordinals, getting
متن کاملThe Determinacy of Context-Free Games
We prove that the determinacy of Gale-Stewart games whose winning sets are accepted by realtime 1-counter Büchi automata is equivalent to the determinacy of (effective) analytic GaleStewart games which is known to be a large cardinal assumption. We show also that the determinacy of Wadge games between two players in charge of ω-languages accepted by 1-counter Büchi automata is equivalent to the...
متن کامل